Strong total chromatic numbers of complete hypergraphs
نویسنده
چکیده
We determine the strong total chromatic number of the complete h-uniform hypergraph Kh, and the complete h-partite hypergraph K,
منابع مشابه
no-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملStar chromatic numbers of hypergraphs and partial Steiner triple systems
The concept of star chromatic number of a graph, introduced by Vince (1988) is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by Bondy and Hell (1990). In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and study their basic properties. In particular, we focus on partial Steiner ...
متن کاملChromatic Polynomials Of Some (m, l)-Hyperwheels
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform (m, l)− hyperwheels and non-uniform (m, l)−hyperfans. These hypergraphs, constructed through a “join” graph operation, are some generalizations of the well-known wh...
متن کاملRecursive Formulae for the Chromatic Polynomials of Complete r-uniform Mixed Interval Hypergraphs
In response to a problem of Voloshin, we find recursive formulae for the chromatic polyno-mials of complete r-uniform interval hypergraphs and cohypergraphs. We also give recursive formulae for the chromatic polynomials of complete 3-uniform and 4-uniform interval bihy-pergraphs and comment on the challenges for general r. Our method is to exploit the uniform and complete structure of these hyp...
متن کاملColoring d-Embeddable k-Uniform Hypergraphs
This paper extends the scenario of the Four Color Theorem in the following way. LetHd,k be the set of all k-uniform hypergraphs that can be (linearly) embedded into Rd . We investigate lower and upper bounds on the maximum (weak and strong) chromatic number of hypergraphs in Hd,k. For example, we can prove that for d ≥ 3 there are hypergraphs inH2d−3,d on n vertices whose weak chromatic number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 138 شماره
صفحات -
تاریخ انتشار 1995